MULTIFOLD MINIMIZING OF UNDETERMINED FINITE AUTOMATION (PASRT I. MAIN ALGORITHMS)

Melnikov Boris Felixovich, Doctor of physical and mathematical sciences, professor, sub-department of applied mathematics and informatics, Tolyatti State University, B.Melnikov@tltsu.ru
Melnikova Alexandra Alexandrovna, Senior lecturer, sub-department of higher mathematics, Dimitrovgrad branch of Ulyanovsk State University, avahi@mail.ru

519.178

In the second part of this paper the authors consider the detailed example of construction of binary relation # and the set of grids of the given regular language; this construction is made in the process of canonization of an automaton defining this language. The article considers two algorithms of combining states of nondeterminis-tic automaton. Based on these algorithms, the researchers formulate a brief algorithm of the edge-minimization, and also an algorithm for adding an edge.

nondeterministic finite automaton, basis automaton, algorithms of equivalent transformation, state-minimization, edge-minimization.